#include <cstdio>
#include <algorithm>

using namespace std;

struct Student{
    int id;
    int h;
};

bool cmp(const Student &x, const Student &y){
    return x.h < y.h;
}

int main(){
    int n;
    scanf("%d", &n);

    Student stu[n + 1];
    for (int i = 0; i < n; i++){
        scanf("%d", &stu[i].h);
        stu[i].id = i + 1;
    }

    stable_sort (stu, stu + n, cmp);
    
    for (int i = 0; i < n; i++) {
        if(i != n-1) {
            printf("%d ", stu[i].id);
        } else {
            printf("%d\n", stu[i].id);
        }
    }

    return 0;
}


